Adaptive Geometry Compression Based on 4-Point Interpolatory Subdivision Schemes
نویسندگان
چکیده
We propose an adaptive geometry compression method based on 4-point interpolatory subdivision schemes. It can work on digital curves of arbitrary dimensions. With the geometry compression method, a digital curve is adaptively compressed into several segments with different compression levels. Each segment is a 4-point subdivision curve with a subdivision step. In the meantime, we provide high-speed 4-point interpolatory subdivision curve generation methods for efficiently decompressing the compressed data. In the decompression methods, we consider both the open curve case and the closed curve case. For an arbitrary positive integer k, formulae of the number of the resultant control points of an open or closed 4-point subdivision curve after k subdivision steps are provided. The time complexity of the new approaches are O(n), where n is the number of the points in the given digital curve. Examples are provided as well to illustrate the efficiency of the proposed approaches.
منابع مشابه
Adaptive geometry compression based on 4-point interpolatory subdivision schemes with labels
We propose an adaptive geometry compression method with labels based on 4-point interpolatory subdivision schemes. It can work on digital curves of arbitrary dimensions. With the geometry compression method, a digital curve is adaptively compressed into several segments with different compression levels. Each segment is a 4-point subdivision curve with a subdivision step. Labels are recorded in...
متن کاملOn Convergent Interpolatory Subdivision Schemes in Riemannian Geometry
We show the convergence (for all input data) of refinement rules in Riemannian manifolds which are analogous to the linear four-point scheme and similar univariate interpolatory schemes, and which are generalized to the Riemannian setting by the so-called log/exp analogy. For this purpose we use a lemma on the Hölder regularity of limits of contractive refinement schemes in metric spaces. In co...
متن کاملA study on the mask of interpolatory symmetric subdivision schemes
In the work, we rebuild the masks of well-known interpolatory symmetric subdivision schemes-binary 2n-point interpolatory schemes, the ternary 4-point interpolatory scheme using only the symmetry and the necessary condition for smoothness and the butterfly scheme, and the modified butterfly scheme using the factorization property. 2006 Elsevier Inc. All rights reserved.
متن کاملAnalysis of Univariate Nonstationary Subdivision Schemes with Application to Gaussian-Based Interpolatory Schemes
This paper is concerned with non-stationary subdivision schemes. First, we derive new sufficient conditions for Cν smoothness of such schemes. Next, a new class of interpolatory 2m-point non-stationary subdivision schemes based on Gaussian interpolation is presented. These schemes are shown to be CL+μ with L ∈ Z+ and μ ∈ (0, 1), where L is the integer smoothness order of the known 2m-point Desl...
متن کاملA Controllable Ternary Interpolatory Subdivision Scheme
A non-uniform 3-point ternary interpolatory subdivision scheme with variable subdivision weights is introduced. Its support is computed. The C and C convergence analysis are presented. To elevate its controllability, a modified edition is proposed. For every initial control point on the initial control polygon a shape weight is introduced. These weights can be used to control the shape of the c...
متن کامل